Enhanced Center Constraint Weighted A* Algorithm for Path Planning of Petrochemical Inspection Robot

نویسندگان

چکیده

In many practical applications of robot path planning, finding the shortest is critical, while response time often overlooked but important. To address problems search node divergence and long calculation in A* routing algorithm large scenario, this paper presents a novel center constraint weighted (CCWA*). The heuristic function modified to give different dynamic weights nodes positions, are changed specified direction during expansion process, thereby reducing number nodes. An adaptive threshold further added enhance adaptiveness algorithm. verify effectiveness CCWA* algorithm, simulations performed on 2-dimensional grid maps sizes. results show that proposed speeds up process reduces planning multi-obstacle environment compared with conventional

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Sensor Placement Algorithm for a Mobile Robot Inspection Planning

In this paper, we address the inspection planning problem to “see” the whole area of the given workspace by a mobile robot. The problem is decoupled into the sensor placement problem and the multi-goal path planning problem to visit found sensing locations. However the decoupled approach provides a feasible solution, its overall quality can be poor, because the sub-problems are solved independe...

متن کامل

A hybrid algorithm for the path center problem

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

متن کامل

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

Sampling-based A* algorithm for robot path-planning

This paper presents a generalization of the classic A* algorithm to the domain of sampling-based motion-planning. The root assumptions of the A* algorithm are examined and reformulated in a manner that enables a direct use of the search strategy as the driving force behind the generation of new samples in a motion-graph. Formal analysis is presented to show probabilistic completeness and conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Intelligent and Robotic Systems

سال: 2021

ISSN: ['1573-0409', '0921-0296']

DOI: https://doi.org/10.1007/s10846-021-01437-8